A Novel Approach for Cheating Prevention through Visual Cryptographic Analysis
نویسندگان
چکیده
Confidentiality is probably the most common aspect of information security and we need to protect our valuable information and it has become an inseparable issue as information technology is ruling the world now. Cryptography is the study of integer mathematical techniques related aspects of Information Security such as confidentiality, data security, entity authentication and data origin authentication but it is not the only means of providing information security, rather one of the techniques. In this paper, a more secure scheme is given to solve the cheating problem without extra burdens by adopting multiple distinct secret images. Moreover, for sharing these secret images simultaneously, the share construction method of visual cryptography is redesigned and extended by generic algorithms. Visual cryptography is a new technique which provides information security which uses simple algorithm unlike the complex, computationally intensive algorithms used in other techniques like traditional cryptography. This technique allows Visual information (pictures, text, etc) to be encrypted in such a way that their decryption can be performed by the human visual system, without any complex cryptographic algorithms. This technique encrypts a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. In this paper we provide an overview of the emerging Visual Cryptography (VC) and related security research work done in this area.
منابع مشابه
A Survey on Cheating Prevention with Verifiable Scheme
Visual Cryptographic technique has become an important field of study in modern cryptography. Visual cryptography (VC) has quite a few applications and some of them are authentication and identification, steganography, and image encryption. As the era demands the need of security and Visual Secret Sharing to resist cheating scenario is a Visual Cryptographic technique. VSS is simple as it is ea...
متن کاملDifferential Power Analysis: A Serious Threat to FPGA Security
Differential Power Analysis (DPA) implies measuring the supply current of a cipher-circuit in an attempt to uncover part of a cipher key. Cryptographic security gets compromised if the current waveforms obtained correlate with those from a hypothetical power model of the circuit. As FPGAs are becoming integral parts of embedded systems and increasingly popular for cryptographic applications and...
متن کاملA new deterministic algorithm based cheating prevention scheme for Visual Cryptography
In 1995, Naor and Shamir proposed the k-out-of-n Visual Cryptography scheme such that only more than or equal to k participants can visually recover the secret through superimposing their transparencies. In 2006, Horng et al. indicated that cheating is possible when some participants create forged transparencies to deceive the remaining participants. In 2007, Tsai et al. proposed another cheati...
متن کاملOn Cheating Immune Secret Sharing
This work addresses the problem of cheating prevention in secret sharing. The scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. In this paper we study the constraints of cheating immune secret sharing schemes. We give a necessary and sufficient condition for SSSs to be cheating immune. Then, we improve the upper bound of D’Arco et. al o...
متن کاملA Novel Scheme for Mutual Authentication and Cheating Prevention in Visual Cryptography using Image Processing
Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. In this paper, we studied the cheating problem in VC by malicious adversaries. We considered the attacks of malicious adversaries who may deviate from the sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011